Two-path subsets: Efficient counting and applications to performability analysis
نویسندگان
چکیده
منابع مشابه
Two-path Subsets: Efficient Counting and Applications to Performability Analysis
The problem of computing performability probabilities in stochastic PERT and ow networks is studied when the network is \minimally designed" to withstand any two component failures. Polynomial-time algorithms to compute performability when the network is planar| the nonplanar versions being NP-hard | solve related \two-path subset" problems. Given an acyclic graph with weights on the arcs, the ...
متن کاملPerformability Analysis of Two Approaches to Fault Tolerance
We present a quantitative comparison of two popular approaches for recovering from CPU errors: Quadruple Modular Redundancy and Backward Error Recovery. Both are used in existing fault-tolerant systems ooering basically the same main features and, in particular, the same fault-tolerance services (transparent recovery for hardware faults). We show that the use of performability measures is riche...
متن کاملStructured Performability Analysis of Fault Tolerant Parallel and Distributed Applications
.................................................................................................................... iv ACKNOWLEDGEMENTS ........................................................................................... v DEDICATION ................................................................................................................ vi LIST OF TABLES ...........................
متن کاملEfficient verification of performability guarantees
The performability of a system is usually evaluated as the mean of a performance measure, aggregated over all failure scenarios (both tolerated and not) through a Markov reward process. This metric can gloss over performance deficiencies in important portions of the failure scenario space, and is also expensive to compute because the number of possible failure scenarios can be very large. We ar...
متن کاملDependability and Performability Analysis
In this tutorial, we discuss several practical issues regarding specification and solution of dependability and performability models. We compare model types with and without rewards. Continuous-time Markov chains (CTMCs) are compared with (continuous-time) Markov reward models (MRMs) and generalized stochastic Petri nets (GSPNs) are compared with stochastic reward nets (SRNs). It is shown that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00027-4